Optimal Estimation of Wavelet Decomposition Level for a Matching Pursuit Algorithm
نویسندگان
چکیده
منابع مشابه
Highly Scalable Matching Pursuit Signal Decomposition Algorithm
Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or “atoms”. A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the resid...
متن کاملstudy of efficiency of seismic time-frequency spectral decomposition by matching pursuit for detecting thin layers
most geologic changes have a seismic response but sometimes this is expressed only in certain spectral ranges hidden within the broadband data. spectral decomposition is one of the methods which can be utilized to help interpreting such cases. there are several time-frequency methods including: short-time fourier transform (stft), continuous wavelet transform (cwt), wigner-ville distribution (w...
متن کاملDirection of arrival estimation using modified orthogonal matching pursuit algorithm
Direction of arrival (DOA) estimation is a sparse reconstruction problem. However, conventional orthogonal matching pursuit (OMP) may fail to identify the correct atoms since the redundant dictionary composed of the direction vectors is highly coherent. To mitigate the coherence problem, in this paper, we propose a modified OMP by constructing data dependent sensing dictionary for sparse recons...
متن کاملSparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm
Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), two methods have been proposed. They are, namely, greedy algorithm and convex program. Greedy algorithm is easy to be im...
متن کاملA remark about orthogonal matching pursuit algorithm
In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21090843